The abc conjecture and non-Wieferich primes in arithmetic progressions

نویسندگان

  • Hester Graves
  • Ram Murty
چکیده

Article history: Received 18 June 2012 Revised 12 September 2012 Accepted 6 October 2012 Available online xxxx Communicated by Greg Martin MSC: 11A41 11B25

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RELAXATIONS OF THE ABC CONJECTURE USING INTEGER k ’TH ROOTS

Weakened forms of the ABC conjecture are defined in terms of the upper k’th root functions. These weakened forms, with quite small explicit values of their parameters, are shown to imply the asymptotic Fermat, Beale, general Fermat, and Catalan conjectures, that there exist an infinite number of non–Wieferich primes, that there exist only finitely many consecutive powerful numbers, Hall’s conje...

متن کامل

A Wieferich Prime Search up to 6 . 7 × 10 15

A Wieferich prime is a prime p such that 2p−1 ≡ 1 (mod p2). Despite several intensive searches, only two Wieferich primes are known: p = 1093 and p = 3511. This paper describes a new search algorithm for Wieferich primes using double-precision Montgomery arithmetic and a memoryless sieve, which runs significantly faster than previously published algorithms, allowing us to report that there are ...

متن کامل

The Green-tao Theorem on Arithmetic Progressions in the Primes: an Ergodic Point of View

A long-standing and almost folkloric conjecture is that the primes contain arbitrarily long arithmetic progressions. Until recently, the only progress on this conjecture was due to van der Corput, who showed in 1939 that there are infinitely many triples of primes in arithmetic progression. In an amazing fusion of methods from analytic number theory and ergodic theory, Ben Green and Terence Tao...

متن کامل

Primes in Arbitrarily Long Arithmetic Progression

It has been a long conjecture that there are arbitrarily long arithmetic progressions of primes. As of now, the longest known progression of primes is of length 26 and was discovered by Benoat Perichon and PrimeGrid in April, 2010 ([1]): 43142746595714191+23681770·223092870n for n = 0, 1, · · · , 25. Many mathematicians have spent years trying to prove (or disprove) this conjecture, and even mo...

متن کامل

The Green-Tao Theorem on Primes in Arithmetic Progression: A Dynamical Point of View

A long standing and almost folkloric conjecture is that the primes contain arbitrarily long arithmetic progressions. Until recently, the only progress on this conjecture was due to van der Corput, who showed in 1939 that there are infinitely many triples of primes in arithmetic progression. In an amazing fusion of methods from analytic number theory and ergodic theory, Ben Green and Terence Tao...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013